An example of elliptic curve over $\mathbf{Q}$ with rank $ > 21$

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An example of elliptic curve over Q with rank equal to 15

We construct an elliptic curve over Q with non-trivial 2-torsion point and rank exactly equal to 15.

متن کامل

THE RANK AND GENERATORS OF KIHARA’S ELLIPTIC CURVE WITH TORSION Z/4Z OVER Q(t)

For the elliptic curve E overQ(t) found by Kihara, with torsion group Z/4Z and rank ≥ 5, which is the current record for the rank of such curves, by using a suitable injective specialization, we determine exactly the rank and generators of E(Q(t)).

متن کامل

Period Determinant of an Irregular Connection over an Elliptic Curve

In this article, we calculate the period of an irregular singular connection ∇ = d+dy on the legendre curve U : y = x(x−1)(x−λ). We calculate its de Rham cohomology and the cycles in the homology of the dual connection and describe the period matrix. Terasoma’s work is introduced to approximate the direct image connection π∗(∇) by a sequence of regular connections as an intermediate step where ...

متن کامل

An FPGA Implementation of an Elliptic Curve Processor over

This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock f...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1994

ISSN: 0386-2194

DOI: 10.3792/pjaa.70.104